Power domain constructions
نویسندگان
چکیده
منابع مشابه
Power domain constructions
The variety of power domain constructions proposed in the literature is put into a general algebraic framework. Power constructions are considered algebras on a higher level: for every ground domain, there is a power domain whose algebraic structure is speciied by means of axioms concerning the algebraic properties of the basic operations empty set, union, singleton, and extension of functions....
متن کاملObservable Modules and Power Domain Constructions
An R-module M is observable ii all its elements can be distinguished by observing them by means of linear morphisms from M to R. We show that free observable R-modules can be explicitly described as the cores of the nal power domains with characteristic semiring R. Then, the general theory is applied to the cases of the lower and the upper semiring. All lower modules are observable, whereas the...
متن کاملLower and Upper Power Domain Constructions Commute on all Cpos
The initial lower and upper power domain constructions P _ and P ^ commute under composition for all cpos. The common result P _ (P ^ X) and P ^ (P _ X) is the free frame over the cpo X.
متن کاملDomain-Dependent Detection of Light Verb Constructions
In this paper, we show how our methods developed for identifying light verb constructions can be adapted to different domains and different types of texts. We both experiment with rule-based methods and machine learning approaches. Our results indicate that existing solutions for detecting light verb constructions can be successfully applied to other domains as well and we conclude that even a ...
متن کاملCS 611 Lecture 13 Domain Constructions 9 /
Because loop-like constructs appear in programming languages so often, we need to take fixed points. In addition, because we are defining meaning functions inductively, most or all of the definitions for individual expression forms need to produce continuous functions. Therefore, we need to find an easy way to show that functions are continuous. We will define a restricted language so that all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1991
ISSN: 0167-6423
DOI: 10.1016/0167-6423(91)90037-x